type sort.lessSwap

20 uses

	sort (current package)
		slice.go#L26: 	pdqsort_func(lessSwap{less, swap}, 0, length, limit)
		slice.go#L38: 	stable_func(lessSwap{less, swap}, rv.Len())
		sort.go#L80: type lessSwap struct {
		zsortfunc.go#L10: func insertionSort_func(data lessSwap, a, b int) {
		zsortfunc.go#L20: func siftDown_func(data lessSwap, lo, hi, first int) {
		zsortfunc.go#L38: func heapSort_func(data lessSwap, a, b int) {
		zsortfunc.go#L61: func pdqsort_func(data lessSwap, a, b, limit int) {
		zsortfunc.go#L135: func partition_func(data lessSwap, a, b, pivot int) (newpivot int, alreadyPartitioned bool) {
		zsortfunc.go#L173: func partitionEqual_func(data lessSwap, a, b, pivot int) (newpivot int) {
		zsortfunc.go#L195: func partialInsertionSort_func(data lessSwap, a, b int) bool {
		zsortfunc.go#L240: func breakPatterns_func(data lessSwap, a, b int) {
		zsortfunc.go#L261: func choosePivot_func(data lessSwap, a, b int) (pivot int, hint sortedHint) {
		zsortfunc.go#L298: func order2_func(data lessSwap, a, b int, swaps *int) (int, int) {
		zsortfunc.go#L307: func median_func(data lessSwap, a, b, c int, swaps *int) int {
		zsortfunc.go#L315: func medianAdjacent_func(data lessSwap, a int, swaps *int) int {
		zsortfunc.go#L319: func reverseRange_func(data lessSwap, a, b int) {
		zsortfunc.go#L329: func swapRange_func(data lessSwap, a, b, n int) {
		zsortfunc.go#L335: func stable_func(data lessSwap, n int) {
		zsortfunc.go#L378: func symMerge_func(data lessSwap, a, m, b int) {
		zsortfunc.go#L464: func rotate_func(data lessSwap, a, m, b int) {